Model Checking Multi-Agent Systems

Applications of model checking for multi-agent systems: verification of diagnosability and recoverability

This paper presents a practical application of model checking for multi-agent systems to the automatic verification of diagnosability. First, a characterisation of diagnosability in terms of epistemic properties of agents is given; then, experimental results are presented for preliminary investigations in the automatic verification of diagnosability of Livingstone models.

Model Checking Multi-Agent Systems

Multi-agent systems are increasingly complex, and the problem of their verification and validation is acquiring increasing importance. In this paper we show how a well known and effective verification technique, model checking, can be generalized to deal with multi-agent systems. This paper explores a particular type of multi-agent system, in which each agent is viewed as having the three menta...

Symbolic Model Checking of Multi-Agent Systems Using OBDDs

Global Model Checking on Pushdown Multi-Agent Systems

Pushdown multi-agent systems, modeled by pushdown game structures (PGSs), are an important paradigm of infinite-state multi-agent systems. Alternatingtime temporal logics are well-known specification formalisms for multi-agent systems, where the selective path quantifier is introduced to reason about strategies of agents. In this paper, we investigate model checking algorithms for variants of a...

Abstraction in model checking multi-agent systems

ion in model checking multi-agent systems Mika Cohen Department of Computing Imperial College London London, UK Mads Dam Access Linnaeus Center Royal Institute of Technology Stockholm, Sweden Alessio Lomuscio Department of Computing Imperial College London London, UK Francesco Russo Department of Computing Imperial College London London, UK

Bounded versus Unbounded Model Checking for Interpreted Systems⋆

This paper addresses the problem of verification of multiagent systems by means of symbolic model checking. It is shown how to adapt the techniques of bounded and unbounded model checking to verify temporal epistemic properties of multi-agent systems. We give details of these two techniques for the logic that extends CTLK by past modalities, and show how it can be applied to the well known trai...